The projection problem in commutative, positively ordered monoids
نویسندگان
چکیده
Abstract We examine the problem of projecting subsets a commutative, positively ordered monoid into an o -ideal. prove that to this end one may restrict sufficient subset, for whose cardinality we provide explicit upper bound. Several applications set functions, vector lattices and other more structures are provided.
منابع مشابه
Injective positively ordered monoids I
We define in this paper a certain notion of completeness for a wide class of commutative (pre)ordered monoids (from now on P.O.M.’s). This class seems to be the natural context for studying structures like measurable function spaces, equidecomposability types of spaces, partially ordered abelian groups and cardinal algebras. Then, we can prove that roughly speaking, spaces of measures with valu...
متن کاملInjective positively ordered monoids II
We continue in this paper the study of positively ordered monoids (P.O.M.’s) initiated in [39]. We prove that injective P.O.M.’s are the retracts of the powers of P=[0, ∞]. We also characterize the natural P.O.M.homomorphism from a given refinement P.O.M to its bidual, with e.g. applications to decomposition spaces. As another application, we prove that a refinement P.O.M admits a ‘Banach limit...
متن کاملCorrigendum: Residuation in Commutative Ordered Monoids with Minimal Zero
The assertional logic S(BCIA) of the quasivariety of BCI-algebras (in Iseki's sense) is axiomatized, relative to pure implicational logic BCI, by the rule x, y, x → y (G) (see [1]). Alternatively, the role of (G) can be played by x x → (y → y) (1) (see [2]). The formula (x → x) → (y → y) (2) is a theorem of S(BCIA). In [2, Proposition 22] we claimed erroneously that, relative to BCI, the axiom ...
متن کاملPartially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...
متن کاملOrdered monoids and J-trivial monoids
In this paper we give a new proof of the following result of Straubing and Thérien: every J -trivial monoid is a quotient of an ordered monoid satisfying the identity x ≤ 1. We will assume in this paper that the reader has a basic background in finite semigroup theory (in particular, Green’s relations and identities defining varieties) and in computer science (languages, trees, heaps). All semi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2022
ISSN: ['0037-1912', '1432-2137']
DOI: https://doi.org/10.1007/s00233-022-10308-z